Yield Enhancement Designs for Wsi Cube Connected Cycles

نویسنده

  • JIA-JYE SHEN
چکیده

In this paper, we present and analyze yield enhancement designs for wafer scale Cube Connected Cycles (CCC). Improvements in yield can be achieved through silicon area reduction and/or through the incorporation of defect/fault tolerance into the architecture. Consequently, we first propose a new compact layout strategy for CCC. We then present a novel implementation of wafer scale CCC based on a universal building block. This implementation facilitates the introduction of redundancy to achieve defect-tolerance. Finally, we derive expressions for the yield of various yield enhancement designs and compare them numerically for several sizes of wafer scale ccc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Yield Enhancement Architecture of WSI Cube-Connected Cycle

The current state of the art in VLSI technology has stimulated research in parallel computers which satisfy the continues increasing demand for computing power in the fields of advanced science and technology. The cube-connected cycle (CCC) is one of the most attractive interconnections and architectures for parallel computers. This paper addresses a new yield enhancement architecture of the cu...

متن کامل

VLSI/WSI Designs for Folded Cube-Connected Cycles Architectures

This paper presents VLSI/WSI designs for a recently introduced parallel architecture known as the folded cube-connected cycles ( F C C C ) . We first discuss two layouts for the FCCC, in which there is no component redundancy. Then we incorporate redundancy, and present locally and globally reconfigurable FCCCs. We also discuss the design of universal building blocks for the construction of fau...

متن کامل

Optimal Routing in the Cube-Connected Cycles Interconnection Network

An optimal message routing algorithm for thc cube-connected cycles processor interconnection network is described, and the average:message path length is derived assuming a uniform message routing distribution. The optimal algorithm is comparetl to one preViously proposed and is shown to have significanlly shorter average path length.

متن کامل

Topological Analysis of P2P Systems

Initial designs of P2P systems such as Napster, Gnutella and Freenet have significant scaling problems. Recently several research groups have independently proposed a new generation of topology-aware P2P systems to support scalable routing and location schemes. As the P2P architecture is becoming popular and more systems are introduced, we feel it necessary to propose an abstract and generic to...

متن کامل

On Crossing Numbers of Hypercubes and Cube Connected Cycles

We prove tight bounds for crossing numbers of hypercube and cube connected cyc1es (CCC) graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989